On a Class of Semigroup Graphs
نویسندگان
چکیده
Let G = Γ(S) be a semigroup graph, i.e., zero-divisor graph of S with zero element 0. For any adjacent vertices x, y in G, denote C(x,y) {z∈V(G) | N (z) {x,y}}. Assume that there exist two y, vertex s∈C(x,y) and z such d (s,z) 3. This paper studies algebraic properties graphs Γ(S), giving some sub-semigroups ideals S. It constructs classes classifies all the property cases.
منابع مشابه
A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملOn a class of intersection graphs
Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call these graphs facility location graphs since they arise from the classical uncapacitated facility location problem. In this paper we show tha...
متن کاملOn a class of finite symmetric graphs
Let Γ be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of Γ . This paper aims to characterize (Γ ,G) under the conditions that the quotient graph ΓB is (G, 2)-arc transitive and the induced subgraph between two adjacent blocks is 2 · K2 or K2,2. The results answer two questions about the relationship between Γ and ΓB for this class of graphs. c © 2007 El...
متن کاملThe Quantifier Semigroup for Bipartite Graphs
In a bipartite graph there are two widely encountered monotone mappings from subsets of one side of the graph to subsets of the other side: one corresponds to the quantifier “there exists a neighbor in the subset” and the other to the quantifier “all neighbors are in the subset.” These mappings generate a partially ordered semigroup which we characterize in terms of “run-unimodal” words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Pure Mathematics
سال: 2023
ISSN: ['2160-0368', '2160-0384']
DOI: https://doi.org/10.4236/apm.2023.136021